- 01. How to Solve Problems
- 02. Days Between Dates
- 03. The Problem
- 04. First Step
- 05. Understanding a Problem
- 06. The First Rule
- 07. What Are the Inputs
- 08. How Are Inputs Represented
- 09. What Are the Outputs
- 10. Obey the Rules
- 11. Next Step
- 12. The Expected Output
- 13. Take the Next Step
- 14. Try an Example
- 15. Harder Example
- 16. Algorithm Pseudocode
- 17. Should We Implement It
- 18. Different Approach
- 19. Simple Mechanical Algorithm
- 20. Don't Optimize Prematurely
- 21. What should We Write First
- 22. Define Simple nextDay
- 23. Making Progress Is Good
- 24. What Should We Do Next
- 25. Define daysBetweenDates
- 26. Step One Pseudocode
- 27. Step Two Helper Function
- 28. Step Three daysBetweenDates
- 29. Test for Valid Inputs
- 30. Real World Problem
- 31. Best Strategy
- 32. Finish daysBetweenDates
- 33. Solution Step I
- 34. Solution Step II
- 35. Solution Step III
- 36. Solution Step IV
- 37. Conclusion
- 38. Learn More: How to Solve Problems